- 01. Intro
- 02. Motion Planning
- 03. Maze
- 04. Maze 2
- 05. Coding the Shortest Path Algorithm
- 06. A* Search
- 07. Lesson Code Structure
- 08. CODE: Starting A* Search
- 09. CODE: Writing the A* Heuristic
- 10. Pass by Reference in C++
- 11. CODE: Adding Nodes to the Open Vector
- 12. CODE: Initialize the Open Vector
- 13. CODE: Create a Comparison Function
- 14. CODE: Write a While Loop for the A* Algorithm
- 15. CODE: Check for Valid Neighbors
- 16. Constants
- 17. CODE: Expand the A* Search to Neighbors
- 18. Arrays
- 19. CODE: Adding a Start and End to the Board
- 20. Congratulations!!
- 21. How to Become More Proficient at C++